Metaheuristics based on Bin Packing for the line balancing problem
نویسندگان
چکیده
منابع مشابه
A genetic algorithm for bin packing and line balancing
The bin packing problem can be best described in 'transportation' terms: given a set of boxes of different sizes, how should one pack them all into containers of a given size, in order to use as few containers as possible? The task of balancing of (robotized) assembly lines is of considerable industrial importance. It consists of assigning operations from a given set to workstations in a produc...
متن کاملA Global Constraint for Bin-Packing with Precedences: Application to the Assembly Line Balancing Problem
Assembly line balancing problems (ALBP) are of capital importance for the industry since the first assembly line for the Ford T by Henry Ford. Their objective is to optimize the design of production lines while satisfying the various constraints. Precedence constraints among the tasks are always present in ALBP. The objective is then to place the tasks among various workstations such that the p...
متن کاملOn-line Sequential Bin Packing
We consider a sequential version of the classical bin packing problem in which items are received one by one. Before the size of the next item is revealed, the decision maker needs to decide whether the next item is packed in the currently open bin or the bin is closed and a new bin is opened. If the new item doesn’t fit, it is lost. If a bin is closed, the remaining free space in the bin accou...
متن کاملTwo-Dimensional On-Line Bin Packing Problem with Rotatable Items
In this paper, we consider a two-dimensional version of the on-line bin packing problem, in which each rectangular item that should be packed into unit square bins is “rotatable” by 90 ◦ . Two on-line algorithms for solving the problem are proposed. The second algorithm is an extension of the 2rst algorithm, and the worst-case ratio of the second one is at least 2.25 and at most 2.565. c © 2002...
متن کاملThe Lazy Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number of accepted items or accepted volume. This paper presents results for the opposite problems, where we want to maximize the number of bins used or minimize the number of accepted items or the accepted volume. For the off-line variant, we require that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2007
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2007018